Involutions, Trace Maps, and Pseudorandom Numbers
نویسندگان
چکیده
Interesting properties of the partitions of a finite field Fq induced by the combination of involutions and trace maps are studied. The special features of involutions of the form u z , u being a fixed element of Fq, are exploited to generate pseudorandom numbers, the randomness resting on the uniform distribution of the images of zero-trace elements among the sets of non-zero trace elements of Fq.
منابع مشابه
Reversible maps and composites of involutions in groups of piecewise linear homeomorphisms of the real line
An element of a group is reversible if it is conjugate to its own inverse, and it is strongly reversible if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be expressed as a composite of two involutions. In this paper the reversible maps, the strongly reversible maps, and those maps that can be expressed as a composite of involutions...
متن کاملAnalyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation
Because of the mixing and aperiodic properties of chaotic maps, such maps have been used as the basis for pseudorandom number generators (PRNGs). However, when implemented on a finite precision computer, chaotic maps have finite and periodic orbits. This manuscript explores the consequences finite precision has on the periodicity of a PRNG based on the logistic map. A comparison is made with co...
متن کاملChaotic Pseudo Random Number Generators via Ultra Weak Coupling of Chaotic Maps and Double Threshold Sampling Sequences
—Generation of random or pseudorandom numbers, nowadays, is a key feature of industrial mathematics. Pseudorandom or chaotic numbers are used in many areas of contemporary technology such as modern communication systems and engineering applications. More and more European or US patents using discrete mappings for this purpose are obtained by researchers of discrete dynamical systems [1], [2]. E...
متن کاملA Very Efficient Pseudo-Random Number Generator Based On Chaotic Maps and S-Box Tables
Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into ...
متن کاملAlgebras and Involutions
• Vectorspaces over division rings • Matrices, opposite rings • Semi-simple modules and rings • Semi-simple algebras • Reduced trace and norm • Other criteria for simplicity • Involutions • Brauer group of a field • Tensor products of fields • Crossed product construction of simple algebras • Cyclic algebra construction of simple algebras • Quaternion algebras • Examples • Unramified extensions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.01212 شماره
صفحات -
تاریخ انتشار 2016